On blind separability based on the temporal predictability method

This letter discusses blind separability based on temporal predictability (Stone, 2001; Xie, He, & Fu, 2005). Our results show that the sources are separable using the temporal predictability method if and only if they have different temporal structures (i.e., autocorrelations). Consequently, the applicability and limitations of the temporal predictability method are clarified. In addition, instead of using generalized eigendecomposition, we suggest using joint approximate diagonalization algorithms to improve the robustness of the method. A new criterion is presented to evaluate the separation results. Numerical simulations are performed to demonstrate the validity of the theoretical results

Least Dependent Component Analysis Based on Mutual Information

We propose to use precise estimators of mutual information (MI) to find least dependent components in a linearly mixed signal. On the one hand this seems to lead to better blind source separation than with any other presently available algorithm. On the other hand it has the advantage, compared to other implementations of `independent' component analysis (ICA) some of which are based on crude approximations for MI, that the numerical values of the MI can be used for: (i) estimating residual dependencies between the output components; (ii) estimating the reliability of the output, by comparing the pairwise MIs with those of re-mixed components; (iii) clustering the output according to the residual interdependencies. For the MI estimator we use a recently proposed k-nearest neighbor based algorithm. For time sequences we combine this with delay embedding, in order to take into account non-trivial time correlations. After several tests with artificial data, we apply the resulting MILCA (Mutual Information based Least dependent Component Analysis) algorithm to a real-world dataset, the ECG of a pregnant woman. The software implementation of the MILCA algorithm is freely available at http://www.fz-juelich.de/nic/cs/softwareComment: 18 pages, 20 figures, Phys. Rev. E (in press

Estimating Mutual Information

We present two classes of improved estimators for mutual information $M(X,Y)$, from samples of random points distributed according to some joint probability density $\mu(x,y)$. In contrast to conventional estimators based on binnings, they are based on entropy estimates from $k$-nearest neighbour distances. This means that they are data efficient (with $k=1$ we resolve structures down to the smallest possible scales), adaptive (the resolution is higher where data are more numerous), and have minimal bias. Indeed, the bias of the underlying entropy estimates is mainly due to non-uniformity of the density at the smallest resolved scale, giving typically systematic errors which scale as functions of $k/N$ for $N$ points. Numerically, we find that both families become {\it exact} for independent distributions, i.e. the estimator $\hat M(X,Y)$ vanishes (up to statistical fluctuations) if $\mu(x,y) = \mu(x) \mu(y)$. This holds for all tested marginal distributions and for all dimensions of $x$ and $y$. In addition, we give estimators for redundancies between more than 2 random variables. We compare our algorithms in detail with existing algorithms. Finally, we demonstrate the usefulness of our estimators for assessing the actual independence of components obtained from independent component analysis (ICA), for improving ICA, and for estimating the reliability of blind source separation.Comment: 16 pages, including 18 figure

Virus Replication as a Phenotypic Version of Polynucleotide Evolution

In this paper we revisit and adapt to viral evolution an approach based on the theory of branching process advanced by Demetrius, Schuster and Sigmund ("Polynucleotide evolution and branching processes", Bull. Math. Biol. 46 (1985) 239-262), in their study of polynucleotide evolution. By taking into account beneficial effects we obtain a non-trivial multivariate generalization of their single-type branching process model. Perturbative techniques allows us to obtain analytical asymptotic expressions for the main global parameters of the model which lead to the following rigorous results: (i) a new criterion for "no sure extinction", (ii) a generalization and proof, for this particular class of models, of the lethal mutagenesis criterion proposed by Bull, Sanju\'an and Wilke ("Theory of lethal mutagenesis for viruses", J. Virology 18 (2007) 2930-2939), (iii) a new proposal for the notion of relaxation time with a quantitative prescription for its evaluation, (iv) the quantitative description of the evolution of the expected values in in four distinct "stages": extinction threshold, lethal mutagenesis, stationary "equilibrium" and transient. Finally, based on these quantitative results we are able to draw some qualitative conclusions.Comment: 23 pages, 1 figure, 2 tables. arXiv admin note: substantial text overlap with arXiv:1110.336

Evolutionary Entropy: A Predictor of Body Size, Metabolic Rate and Maximal Life Span

Body size of organisms spans 24 orders of magnitude, and metabolic rate and life span present comparable differences across species. This article shows that this variation can be explained in terms of evolutionary entropy, a statistical parameter which characterizes the robustness of a population, and describes the uncertainty in the age of the mother of a randomly chosen newborn. We show that entropy also has a macroscopic description: It is linearly related to the logarithm of the variables body size, metabolic rate, and life span. Furthermore, entropy characterizes Darwinian fitness, the efficiency with which a population acquires and converts resources into viable offspring. Accordingly, entropy predicts the outcome of natural selection in populations subject to different classes of ecological constraints. This predictive property, when integrated with the macroscopic representation of entropy, is the basis for enormous differences in morphometric and life-history parameters across species